Convergence analysis of the Gauss-NewtonPotra method for nonlinear least squares problems
نویسندگان
چکیده
منابع مشابه
Global Convergence of a New Hybrid Gauss--Newton Structured BFGS Method for Nonlinear Least Squares Problems
In this paper, we propose a hybrid Gauss-Newton structured BFGS method with a new update formula and a new switch criterion for the iterative matrix to solve nonlinear least squares problems. We approximate the second term in the Hessian by a positive definite BFGS matrix. Under suitable conditions, global convergence of the proposed method with a backtracking line search is established. Moreov...
متن کاملApproximate Gauss-Newton Methods for Nonlinear Least Squares Problems
The Gauss–Newton algorithm is an iterative method regularly used for solving nonlinear least squares problems. It is particularly well suited to the treatment of very large scale variational data assimilation problems that arise in atmosphere and ocean forecasting. The procedure consists of a sequence of linear least squares approximations to the nonlinear problem, each of which is solved by an...
متن کاملOn the convergence of an inexact Gauss-Newton trust-region method for nonlinear least-squares problems with simple bounds
We introduce an inexact Gauss-Newton trust-region method for solving bound-constrained nonlinear least-squares problems where, at each iteration, a trust-region subproblem is approximately solved by the Conjugate Gradient method. Provided a suitable control on the accuracy to which we attempt to solve the subproblems, we prove that the method has global and asymptotic fast convergence properties.
متن کاملThe University of Reading Approximate Gauss-Newton methods for nonlinear least squares problems
The Gauss-Newton algorithm is an iterative method regularly used for solving nonlinear least squares problems. It is particularly well-suited to the treatment of very large scale variational data assimilation problems that arise in atmosphere and ocean forecasting. The procedure consists of a sequence of linear least squares approximations to the nonlinear problem, each of which is solved by an...
متن کاملVariable projection for nonlinear least squares problems
The variable projection algorithm of Golub and Pereyra (1973) has proven to be quite valuable in the solution of nonlinear least squares problems in which a substantial number of the parameters are linear. Its advantages are efficiency and, more importantly, a better likelihood of finding a global minimizer rather than a local one. The purpose of our work is to provide a more robust implementat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Matematychni Studii
سال: 2018
ISSN: 1027-4634
DOI: 10.15330/ms.50.2.211-221